Alternating Direction Method of Multipliers for Linear Programming
نویسندگان
چکیده
Recently the alternating direction method of multipliers (ADMM) has been widely used for various applications arising in scientific computing areas. Most of these application models are, or can be easily reformulated as, linearly constrained convex minimization models with separable nonlinear objective functions. In this note we show that ADMM can also be easily used for the canonical linear programming model; and the resulting complexity is O(mn) where m is the constraint number and n is the variable dimension. Moreover, at each iteration there are m subproblems that are eligible for parallel computation; and each of them only requires O(n) flops. This ADMM application provides a new approach to linear programming, which is completely different from the major simplex and interior point approaches in the literature.
منابع مشابه
Modified Convex Data Clustering Algorithm Based on Alternating Direction Method of Multipliers
Knowing the fact that the main weakness of the most standard methods including k-means and hierarchical data clustering is their sensitivity to initialization and trapping to local minima, this paper proposes a modification of convex data clustering in which there is no need to be peculiar about how to select initial values. Due to properly converting the task of optimization to an equivalent...
متن کاملLocal Linear Convergence of the Alternating Direction Method of Multipliers on Quadratic or Linear Programs
We introduce a novel matrix recurrence yielding a new spectral analysis of the local transient convergence behavior of the Alternating Direction Method of Multipliers (ADMM), for the particular case of a quadratic program or a linear program. We identify a particular combination of vector iterates whose convergence can be analyzed via a spectral analysis. The theory predicts that ADMM should go...
متن کاملA symmetric version of the generalized alternating direction method of multipliers for two-block separable convex programming
This paper introduces a symmetric version of the generalized alternating direction method of multipliers for two-block separable convex programming with linear equality constraints, which inherits the superiorities of the classical alternating direction method of multipliers (ADMM), and which extends the feasible set of the relaxation factor α of the generalized ADMM to the infinite interval [F...
متن کاملLinear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming*
In this paper, we aim to prove the linear rate convergence of the alternating direction method of multipliers (ADMM) for solving linearly constrained convex composite optimization problems. Under a mild calmness condition, which holds automatically for convex composite piecewise linear-quadratic programming, we establish the global Q-linear rate of convergence for a general semi-proximal ADMM w...
متن کاملOn the O(1/t) convergence rate of Eckstein and Bertsekas’s generalized alternating direction method of multipliers
This note shows the O(1/t) convergence rate of Eckstein and Bertsekas’s generalized alternating direction method of multipliers in the context of convex minimization with linear constraints.
متن کامل